Uniqueness of Solution to Systems of Elliptic Operators and Application to Asymptotic Synchronization of Linear Dissipative Systems II: Case of Multiple Feedback Dampings

In this paper, the authors consider the asymptotic synchronization of a linear dissipative system with multiple feedback dampings. They ?rst show that under the observability of a scalar equation, Kalman’s rank condition is su?cient for the uniqueness of solution to a complex system of elliptic equations with mixedobservations. The authors then establish a general theory on the asymptotic stability and the asymptotic synchronization for the corresponding evolutional system subjected to mixed dampings of various natures. Some classic models are presented to illustrate the ?eld of applications of the abstract theory.     

On the complexity of extending the convergence ball of Wang’s method for finding a zero of a derivative

Ball convergence results are very important, since they demonstrate the complexity in choosing initial points for iterative methods. One of the most important problems in the study of iterative methods is to determine the convergence ball. This ball is small in general restricting the choice of initial points. We address this problem in the case of Wang’s method utilized to determine a zero of a derivative. Finding such a zero has many applications in computational fields, especially in function optimization. In particular, we find the convergence ball of Wang’s method using hypotheses up to the second derivative in contrast to earlier studies using hypotheses up to the fourth derivative. This way, we also extend the applicability of Wang’s method. Numerical experiments used to test the convergence criteria complete this study.     

γ-variable first-order logic of uniform attachment random graphs

We study logical limit laws for uniform attachment random graphs. In this random graph model, vertices and edges are introduced recursively: at time $n+1$, the vertex $n+1$ is introduced together with m edges joining the new vertex with m different vertices chosen uniformly at random from $1,\dots ,n$. We prove that this random graph obeys convergence law for first-order sentences with at most $m?2$ variables.